A Critical Look at Self-Dual Codes∗
نویسنده
چکیده
We investigate self-dual codes from a structural point of view. In particular, we study properties of critical indecomposable codes which appear in the spectrum of a self-dual code. As an application of the results we obtain, we revisit the study of self-dual codes of dimension at most 10.
منابع مشابه
On Euclidean and Hermitian Self-Dual Cyclic Codes over $\mathbb{F}_{2^r}$
Cyclic and self-dual codes are important classes of codes in coding theory. Jia, Ling and Xing [5] as well as Kai and Zhu [7] proved that Euclidean self-dual cyclic codes of length n over Fq exist if and only if n is even and q = 2 , where r is any positive integer. For n and q even, there always exists an [n, n 2 ] self-dual cyclic code with generator polynomial x n 2 + 1 called the trivial se...
متن کاملSelf-dual Codes Using Image Restoration Techniques
From past literature it is evident that the search for self-dual codes has been hampered by the computational difficulty of generating the Hadamard matrices required. The use of the cocyclic construction of Hadamard matrices has permitted substantial cut-downs in the search time, but the search space still grows exponentially. Here we look at an adaptation of image-processing techniques for the...
متن کاملOn the automorphism groups of binary linear codes
Let C be a binary linear code and suppose that its automorphism group contains a non trivial subgroup G. What can we say about C knowing G? In this paper we collect some answers to this question in the cases G ∼= Cp, G ∼= C2p and G ∼= D2p (p an odd prime), with a particular regard to the case in which C is self-dual. Furthermore we generalize some methods used in other papers on this subject. F...
متن کاملOn Self-Dual Quantum Codes, Graphs, and Boolean Functions
A short introduction to quantum error correction is given, and it is shown that zero-dimensional quantum codes can be represented as self-dual additive codes over GF(4) and also as graphs. We show that graphs representing several such codes with high minimum distance can be described as nested regular graphs having minimum regular vertex degree and containing long cycles. Two graphs correspond ...
متن کاملNew MDS or near MDS self-dual codes over finite fields
The study of MDS self-dual codes has attracted lots of attention in recent years. There are many papers on determining existence of q−ary MDS self-dual codes for various lengths. There are not existence of q−ary MDS self-dual codes of some lengths, even these lengths < q. We generalize MDS Euclidean self-dual codes to near MDS Euclidean self-dual codes and near MDS isodual codes. And we obtain ...
متن کامل